Spectral inequalities for matrix exponentials
نویسندگان
چکیده
منابع مشابه
Matrix Exponentials - Another Approach
The exponential of a matrix and the spectral decomposition of a matrix can be computed knowing nothing more than the eigenvalues of the matrix and the Cayley–Hamilton theorem. The arrangement of the ideas in this paper is simple enough to be taught to beginning students of ODEs.
متن کاملUsing Matrix Exponentials for Abstract Argumentation
We investigate the relationship between semantics for formal argumentation and measures from social networking theory. In particular, we consider using matrix exponentials, which are measures used for link prediction and recommendation in social networks, as a way to measure acceptability of arguments in abstract argumentation frameworks. We reformulate the approach of matrix exponentials to ad...
متن کاملError Bounds for the Lanczos Methods for Approximating Matrix Exponentials
In this paper, we present new error bounds for the Lanczos method and the shift-andinvert Lanczos method for computing e−τAv for a large sparse symmetric positive semidefinite matrix A. Compared with the existing error analysis for these methods, our bounds relate the convergence to the condition numbers of the matrix that generates the Krylov subspace. In particular, we show that the Lanczos m...
متن کاملUsing Matrix Exponentials to Explore Spatial Structure in Regression Relationships
Spatial regression relationships typically specify the structure of spatial relationships among observations using a fixed n by n weight matrix, where n denotes the number of observations. For computational convenience, this weight matrix is usually assumed to represent fixed sample information, making inferences conditional on the particular spatial structure embodied in the weight matrix used...
متن کاملComparing Leja and Krylov Approximations of Large Scale Matrix Exponentials
We have implemented a numerical code (ReLPM, Real Leja Points Method) for polynomial interpolation of the matrix exponential propagators exp (∆tA)v and φ(∆tA)v, φ(z) = (exp (z) − 1)/z. The ReLPM code is tested and compared with Krylov-based routines, on large scale sparse matrices arising from the spatial discretization of 2D and 3D advection-diffusion equations.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 1988
ISSN: 0024-3795
DOI: 10.1016/0024-3795(88)90048-1